Arithmetic complexity revisited
نویسندگان
چکیده
The arithmetic complexity counts the number of algebraically independent entries in periodic continued fraction $\theta=[b_1,\dots, b_N, \overline{a_1,\dots,a_k}]$. If $\mathscr{A}_{\theta}$ is a noncommutative torus corresponding to rational elliptic curve $\mathscr{E}(K)$, then rank $\mathscr{E}(K)$ given by simple formula $r(\mathscr{E}(K))= c(\mathscr{A}_{\theta})-1$, where $c(\mathscr{A}_{\theta})$ $\theta$. We prove that equal dimension Brock-Elkies-Jordan variety $\theta$ introduced [1]. Following Zagier and Lemmermeyer, we evaluate Shafarevich-Tate group $\mathscr{E}(K)$.
منابع مشابه
Linear Integer Arithmetic Revisited
We consider feasibility of linear integer programs in the context of verification systems such as SMT solvers or theorem provers. Although satisfiability of linear integer programs is decidable, many stateof-the-art solvers neglect termination in favor of efficiency. It is challenging to design a solver that is both terminating and practically efficient. Recent work by Jovanović and de Moura co...
متن کاملAverage Case Complexity, Revisited
More than two decades elapsed since Levin set forth a theory of average-case complexity. In this survey we present the basic aspects of this theory as well as some of the main results regarding it. The current presentation deviates from our old “Notes on Levin’s Theory of Average-Case Complexity” (ECCC, TR97-058, 1997) in several aspects.
متن کاملReversal complexity revisited
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several further tapes on which head reversals remain unrestricted, but size is bounded by s(n) (where n denotes the input length). Recently [9,10], such machines were introduced as a formalization of a computation model that restr...
متن کاملComplexity Spaces Revisited
The complexity (quasi-pseudo-metric) spaces have been introduced as part of the development of a topological foundation for the complexity analysis of algorithms ((Sch95]). Applications of this theory to the complexity analysis of Divide & Conquer algorithms have been discussed in Sch95]. Typically these applications involve xed point arguments based on the Smyth completion. The notion of S-com...
متن کاملComplexity and stability revisited
Vincent A. A. Jansen* and Giorgos D. Kokkoris School of Biological Sciences, Royal Holloway, University of London, Egham, Surrey, UK Biodiversity Conservation Laboratory, Department of Environmental Studies, University of the Aegean, Mytilene, Greece *Correspondence: E-mail: [email protected] Abstract Since Robert May’s work on random community matrices it has been known that stability ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The journal of analysis
سال: 2023
ISSN: ['0971-3611']
DOI: https://doi.org/10.1007/s41478-023-00554-x